Integer convolution via split-radix fast Galois transform

نویسنده

  • Richard E. Crandall
چکیده

Integer convolution can be effected, as is well known, via certain number-theoretical transforms. One particular transform, which we call a discrete Galois transform (DGT), can be used efficiently for either cyclic or negacyclic integer convolution. The DGT has the feature that, if an appropriate prime p for the field GF(p) be specified, the allowed power-of-two signal lengths can be quite large. Though the DGTs we consider involve complex arithmetic (amongst Gaussian integers a + bi mod p), it turns out that the run lengths can, in certain settings, be halved. Thus, the fact of real-valued, integer input signals can be exploited along such lines, to enhance the performance of a resulting fast Galois transform (FGT) algorithm. Furthermore, split-radix FFT structure can be bestowed upon the FGT, again boosting efficiency for integer convolution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An express-reconstruction of distorted speech by inverse filtering method

An express-reconstruction of distorted speech signals based on a fast filtering algoritlun for inverting linear convolution by sectioning method combined with effective realvalued split radix fast Fourier transform (FFT) algorithms are proposed.

متن کامل

Improved Fourier and Hartley transform algorithms: Application to cyclic convolution of real data

This paper highlights the possible tradeoffs between arithmetic and structural complexity when computing cyclic convolution of real data in the transform domain. Both Fourier and Hartley-based schemes are first explained in their usual form and then improved, either from the structural point of view or in the number of operations involved. Namely, we first present an algorithm for the in-place ...

متن کامل

Integer fast Fourier transform (INTFFT)

In this paper, a concept of integer fast Fourier transform (IntFFT) for approximating the discrete Fourier transform is introduced. Unlike the fixed-point fast Fourier transform (FxpFFT), the new transform has properties that it is an integer-to-integer mapping, power adaptable and also reversible. Lifting scheme is used to approximate complex multiplications appearing in the FFT lattice struct...

متن کامل

Optimized FFT Algorithm and its Application to Fast GPS Signal Acquisition

The essence of GPS signal acquisition is a two-dimensional search process for the carrier Doppler and code phase, generally including correlator, signal capture device, and logic control module. The disposal efficiency of correlator would affect the capture speed of the whole acquisition process. Because of the corresponding relation between frequencydomain multiplication and time-domain convol...

متن کامل

Invited Paper Fast Fourier Transforms: a Tutorial Review and a State of the Art

The publication of the Cooley-Tukey fast Fourier transform (FIT) algorithm in 1965 has opened a new area in digital signal processing by reducing the order of complexity of some crucial computational tasks like Fourier transform and convolution from N 2 to N log2 N, where N is the problem size. The development of the major algorithms (Cooley-Tukey and split-radix FFT, prime factor algorithm and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005